Serveur d'exploration sur la visibilité du Havre

Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.

Contribution to hybrid heuristic optimization methods : Distribution and application on information systems interoperability

Identifieur interne : 000570 ( Main/Exploration ); précédent : 000569; suivant : 000571

Contribution to hybrid heuristic optimization methods : Distribution and application on information systems interoperability

Auteurs : Norelislam El Hami [France]

Source :

RBID : Hal:tel-00771360

Descripteurs français

English descriptors

Abstract

The work presented in this PhD thesis contibutes to a new method for a modified particle swarm optimization algorith (MPSO) combined with a simulating annealing algorithm (SA). MPSO is known as an efficient approach with a high performance of solving optimization problems in many research fields. It is a population intelligence algorithm [Eberhart et Kennedy (1995)] inspired by social behavior simulations of bird flocking. Considerable research work on classical method PSO (Particle Swarm Optimization) has been done to improve the performance of this method. Therefore, the propose hybrid optimization algorithms MPSOSA use the combination of MPSO and simulating annealing SA. This method has the avantage to provide best results comparing with all heuristics methods PSO and SA. In this matter, a benchmark of eighteen well-known functions is given. These functions present different situations of finding the global minimum with gradual difficulties. Numerical results presented, in this paper, show the robustness of the MPSOSA algorithm. Numerical comparisons with three algorithms namely, Simulating Annealing, Modified Particle swarm optimization and MPSO-SA show that hybrid algorithm offers better results. This method (MPSO-SA) treats a wide range of optimization problems, in information systems interoperability and in structural optimization field.

Url:


Affiliations:


Links toward previous steps (curation, corpus...)


Le document en format XML

<record>
<TEI>
<teiHeader>
<fileDesc>
<titleStmt>
<title xml:lang="en">Contribution to hybrid heuristic optimization methods : Distribution and application on information systems interoperability</title>
<title xml:lang="fr">Contribution aux méthodes hybrides d'optimisation heuristique : Distribution et application à l'interopérabilité des systèmes d'information</title>
<author>
<name sortKey="El Hami, Norelislam" sort="El Hami, Norelislam" uniqKey="El Hami N" first="Norelislam" last="El Hami">Norelislam El Hami</name>
<affiliation wicri:level="1">
<hal:affiliation type="laboratory" xml:id="struct-23832" status="VALID">
<orgName>Laboratoire d'Informatique, de Traitement de l'Information et des Systèmes</orgName>
<orgName type="acronym">LITIS</orgName>
<desc>
<address>
<addrLine>Avenue de l'Université UFR des Sciences et Techniques 76800 Saint-Etienne du Rouvray</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.litislab.eu</ref>
</desc>
<listRelation>
<relation active="#struct-300317" type="direct"></relation>
<relation name="EA4108" active="#struct-300318" type="direct"></relation>
<relation active="#struct-301288" type="direct"></relation>
<relation active="#struct-301232" type="indirect"></relation>
</listRelation>
<tutelles>
<tutelle active="#struct-300317" type="direct">
<org type="institution" xml:id="struct-300317" status="VALID">
<orgName>Université du Havre</orgName>
<desc>
<address>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle name="EA4108" active="#struct-300318" type="direct">
<org type="institution" xml:id="struct-300318" status="VALID">
<orgName>Université de Rouen</orgName>
<desc>
<address>
<addrLine> 1 rue Thomas Becket - 76821 Mont-Saint-Aignan</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-rouen.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-301288" type="direct">
<org type="department" xml:id="struct-301288" status="VALID">
<orgName>Institut National des Sciences Appliquées - Rouen</orgName>
<orgName type="acronym">INSA Rouen</orgName>
<desc>
<address>
<country key="FR"></country>
</address>
</desc>
<listRelation>
<relation active="#struct-301232" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-301232" type="indirect">
<org type="institution" xml:id="struct-301232" status="VALID">
<orgName>Institut National des Sciences Appliquées</orgName>
<orgName type="acronym">INSA</orgName>
<desc>
<address>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
<placeName>
<settlement type="city">Le Havre</settlement>
<region type="region" nuts="2">Région Normandie</region>
<region type="old region" nuts="2">Haute-Normandie</region>
</placeName>
<orgName type="university">Université du Havre</orgName>
<placeName>
<settlement type="city">Rouen</settlement>
<region type="region" nuts="2">Région Normandie</region>
<region type="old region" nuts="2">Haute-Normandie</region>
</placeName>
<orgName type="university">Université de Rouen</orgName>
</affiliation>
</author>
</titleStmt>
<publicationStmt>
<idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:tel-00771360</idno>
<idno type="halId">tel-00771360</idno>
<idno type="halUri">https://tel.archives-ouvertes.fr/tel-00771360</idno>
<idno type="url">https://tel.archives-ouvertes.fr/tel-00771360</idno>
<date when="2012-06-23">2012-06-23</date>
<idno type="wicri:Area/Hal/Corpus">000070</idno>
<idno type="wicri:Area/Hal/Curation">000070</idno>
<idno type="wicri:Area/Hal/Checkpoint">000297</idno>
<idno type="wicri:Area/Main/Merge">000574</idno>
<idno type="wicri:Area/Main/Curation">000570</idno>
<idno type="wicri:Area/Main/Exploration">000570</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en">Contribution to hybrid heuristic optimization methods : Distribution and application on information systems interoperability</title>
<title xml:lang="fr">Contribution aux méthodes hybrides d'optimisation heuristique : Distribution et application à l'interopérabilité des systèmes d'information</title>
<author>
<name sortKey="El Hami, Norelislam" sort="El Hami, Norelislam" uniqKey="El Hami N" first="Norelislam" last="El Hami">Norelislam El Hami</name>
<affiliation wicri:level="1">
<hal:affiliation type="laboratory" xml:id="struct-23832" status="VALID">
<orgName>Laboratoire d'Informatique, de Traitement de l'Information et des Systèmes</orgName>
<orgName type="acronym">LITIS</orgName>
<desc>
<address>
<addrLine>Avenue de l'Université UFR des Sciences et Techniques 76800 Saint-Etienne du Rouvray</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.litislab.eu</ref>
</desc>
<listRelation>
<relation active="#struct-300317" type="direct"></relation>
<relation name="EA4108" active="#struct-300318" type="direct"></relation>
<relation active="#struct-301288" type="direct"></relation>
<relation active="#struct-301232" type="indirect"></relation>
</listRelation>
<tutelles>
<tutelle active="#struct-300317" type="direct">
<org type="institution" xml:id="struct-300317" status="VALID">
<orgName>Université du Havre</orgName>
<desc>
<address>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle name="EA4108" active="#struct-300318" type="direct">
<org type="institution" xml:id="struct-300318" status="VALID">
<orgName>Université de Rouen</orgName>
<desc>
<address>
<addrLine> 1 rue Thomas Becket - 76821 Mont-Saint-Aignan</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-rouen.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-301288" type="direct">
<org type="department" xml:id="struct-301288" status="VALID">
<orgName>Institut National des Sciences Appliquées - Rouen</orgName>
<orgName type="acronym">INSA Rouen</orgName>
<desc>
<address>
<country key="FR"></country>
</address>
</desc>
<listRelation>
<relation active="#struct-301232" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-301232" type="indirect">
<org type="institution" xml:id="struct-301232" status="VALID">
<orgName>Institut National des Sciences Appliquées</orgName>
<orgName type="acronym">INSA</orgName>
<desc>
<address>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
<placeName>
<settlement type="city">Le Havre</settlement>
<region type="region" nuts="2">Région Normandie</region>
<region type="old region" nuts="2">Haute-Normandie</region>
</placeName>
<orgName type="university">Université du Havre</orgName>
<placeName>
<settlement type="city">Rouen</settlement>
<region type="region" nuts="2">Région Normandie</region>
<region type="old region" nuts="2">Haute-Normandie</region>
</placeName>
<orgName type="university">Université de Rouen</orgName>
</affiliation>
</author>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc>
<textClass>
<keywords scheme="mix" xml:lang="en">
<term>Hybrid algorithm</term>
<term>Interoperability</term>
<term>Particle swarm optimization</term>
<term>Structural optimization</term>
</keywords>
<keywords scheme="mix" xml:lang="fr">
<term>Algorithme hybride</term>
<term>Interopérabilité</term>
<term>Optimisation des structures</term>
<term>Optimisation par essaim de particules</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front>
<div type="abstract" xml:lang="en">The work presented in this PhD thesis contibutes to a new method for a modified particle swarm optimization algorith (MPSO) combined with a simulating annealing algorithm (SA). MPSO is known as an efficient approach with a high performance of solving optimization problems in many research fields. It is a population intelligence algorithm [Eberhart et Kennedy (1995)] inspired by social behavior simulations of bird flocking. Considerable research work on classical method PSO (Particle Swarm Optimization) has been done to improve the performance of this method. Therefore, the propose hybrid optimization algorithms MPSOSA use the combination of MPSO and simulating annealing SA. This method has the avantage to provide best results comparing with all heuristics methods PSO and SA. In this matter, a benchmark of eighteen well-known functions is given. These functions present different situations of finding the global minimum with gradual difficulties. Numerical results presented, in this paper, show the robustness of the MPSOSA algorithm. Numerical comparisons with three algorithms namely, Simulating Annealing, Modified Particle swarm optimization and MPSO-SA show that hybrid algorithm offers better results. This method (MPSO-SA) treats a wide range of optimization problems, in information systems interoperability and in structural optimization field.</div>
</front>
</TEI>
<affiliations>
<list>
<country>
<li>France</li>
</country>
<region>
<li>Haute-Normandie</li>
<li>Région Normandie</li>
</region>
<settlement>
<li>Le Havre</li>
<li>Rouen</li>
</settlement>
<orgName>
<li>Université de Rouen</li>
<li>Université du Havre</li>
</orgName>
</list>
<tree>
<country name="France">
<region name="Région Normandie">
<name sortKey="El Hami, Norelislam" sort="El Hami, Norelislam" uniqKey="El Hami N" first="Norelislam" last="El Hami">Norelislam El Hami</name>
</region>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/France/explor/LeHavreV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000570 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000570 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/France
   |area=    LeHavreV1
   |flux=    Main
   |étape=   Exploration
   |type=    RBID
   |clé=     Hal:tel-00771360
   |texte=   Contribution to hybrid heuristic optimization methods : Distribution and application on information systems interoperability
}}

Wicri

This area was generated with Dilib version V0.6.25.
Data generation: Sat Dec 3 14:37:02 2016. Site generation: Tue Mar 5 08:25:07 2024